Construction of Intersection of Nondeterministic Finite Automata using Z Notation
نویسندگان
چکیده
Functionalities and control behavior are both primary requirements in design of a complex system. Automata theory plays an important role in modeling behavior of a system. Z is an ideal notation which is used for describing state space of a system and then defining operations over it. Consequently, an integration of automata and Z will be an effective tool for increasing modeling power for a complex system. Further, nondeterministic finite automata (NFA) may have different implementations and therefore it is needed to verify the transformation from diagrams to a code. If we describe formal specification of an NFA before implementing it, then confidence over transformation can be increased. In this paper, we have given a procedure for integrating NFA and Z. Complement of a special type of NFA is defined. Then union of two NFAs is formalized after defining their complements. Finally, formal construction of intersection of NFAs is described. The specification of this relationship is analyzed and validated using Z/EVES tool. Keywords—Modeling, Nondeterministic finite automata, Z notation, Integration of approaches, Validation.
منابع مشابه
Simplifying Regular Expressions: A Quantitative Perspective
In this work, we consider the efficient simplification of regular expressions. We suggest a quantitative comparison of heuristics for simplifying regular expressions. We propose a new normal form for regular expressions, which outperforms previous heuristics while still being computable in linear time. We apply this normal form to determine an exact bound for the relation between the two most c...
متن کاملOn the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection
Extended regular expressions (with complement and intersection) are used in many applications due to their succinctness. In particular, regular expressions extended with intersection only (also called semi-extended) can already be exponentially smaller than standard regular expressions or equivalent nondeterministic finite automata (NFA). For practical purposes it is important to study the aver...
متن کاملNondeterministic state complexity of nested word automata
We study the nondeterministic state complexity of Boolean operations on regular languages of nested words. For union and intersection we obtain matching upper and lower bounds. For complementation of a nondeterministic nested word automaton with n states we establish a lower boundΩ( √ n!) that is significantly worse than the exponential lower bound for ordinary nondeterministic finite automata ...
متن کاملLanguages and Computation (G52LAC) Lecture notes Spring 2017
3 Finite Automata 11 3.1 Deterministic finite automata . . . . . . . . . . . . . . . . . . . . 11 3.1.1 What is a DFA? . . . . . . . . . . . . . . . . . . . . . . . 11 3.1.2 The language of a DFA . . . . . . . . . . . . . . . . . . . 13 3.2 Nondeterministic finite automata . . . . . . . . . . . . . . . . . . 14 3.2.1 What is an NFA? . . . . . . . . . . . . . . . . . . . . . . . 14 3.2.2 The lan...
متن کاملNondeterministic State Complexity of Positional Addition
Consider nondeterministic finite automata recognizing base-k positional notation of numbers. Assume that numbers are read starting from their least significant digits. It is proved that if two sets of numbers S and T are represented by nondeterministic automata of m and n states, respectively, then their sum {s+ t | s ∈ S, t ∈ T } is represented by a nondeterministic automaton with 2mn+2m+2n+1 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012